SIMULTANEOUS FAILURE PROBABILITY OF CORRELATED PERFORMANCE FUNCTIONS : II. Tri-modal bounds
نویسندگان
چکیده
منابع مشابه
Correlated Decoding for Channels with Arbitrarily Varying Channel Probability Functions
Let X = I1, " '" , a}, Y = {1, ' " , b} be finite sets. A stochastic matrix w with a rows and b columns will be called a channel. X, Y are the input and output alphabets (respectively) of the channel. We denote the set of all channels with input alphabet X and output alphabet Y by e (X, Y). A channel w E C (X, Y) can be used for communication from one person, the sender, to another person, the ...
متن کاملProbability Bounds for Polynomial Functions in Random Variables
Random sampling is a simple but powerful method in statistics and the design of randomized algorithms. In a typical application, random sampling can be applied to estimate an extreme value, say maximum, of a function f over a set S ⊆ R. To do so, one may select a simpler (even finite) subset S0 ⊆ S, randomly take some samples over S0 for a number of times, and pick the best sample. The hope is ...
متن کاملNonasymptotic Probability Bounds for Fading Channels Exploiting Dedekind Zeta Functions
In this paper, new probability bounds are derived for algebraic lattice codes. This is done by using the Dedekind zeta functions of the algebraic number fields involved in the lattice constructions. In particular, it is shown how to upper bound the error performance of a finite constellation on a Rayleigh fading channel and the probability of an eavesdropper’s correct decision in a wiretap chan...
متن کاملProbability Bounds
This document starts from simple probalistic inequalities (Markov’s Inequality) and builds up through several stronger concentration results, developing a few ideas about Rademacher complexity, until we give proofs of the main Vapnik-Chervonenkis complexity for learning theory. Many of these proofs are based on Peter Bartlett’s lectures for CS281b at Berkeley or Rob Schapire’s lectures at Princ...
متن کاملPerformance bounds for queues via generating functions
Modern applications, e.g. vlsi manufacturing, give rise to complicated queueing models, often of the re-entrant type. Their complexity, together with implications of their performance, renewed interest in their performance and the computation of good control (e.g. scheduling) policies. Recent work concentrated on computable (mostly linear) performance bounds. We show that the linear bounds can ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Structural and Construction Engineering (Transactions of AIJ)
سال: 1986
ISSN: 0910-8025,2433-0000
DOI: 10.3130/aijsx.368.0_18